Partitioning and Dynamic Load Balancing of Adaptive Hybrid Grids for Large-Scale Turbulent Flow Simulations
نویسندگان
چکیده
A new partitioning method for complex 3-D hybrid prismatic/tetrahedral meshes is presented, The method uses an orthogonal recursive bisection approach on a special octree corresponding to the hybrid grid. The octree is generated automatically and handles any type of 3-D geometry and domain connectivity. It is employed for partitioning of static, as well as dynamic adaptive meshes. The method yields similar quality partitions for very different geometries, such as a sphere and an aircraft configuration. The strategy for load balancing is applied to octants which leads to an efSicient parallel algorithm. Results include partitioning a hybrid grid around an aircraft configuration and octree-based load balancing for a dynamically adapted mesh. The method is applied to large-scale turbulent flow simulations around aircraft configura-
منابع مشابه
Cluster-based Communication and Load Balancing for Simulations on Dynamically Adaptive Grids
The present paper introduces a new communication and load-balancing scheme based on a clustering of the grid which we use for the efficient parallelization of simulations on dynamically adaptive grids. With a partitioning based on space-filling curves (SFCs), this yields several advantageous properties regarding the memory requirements and load balancing. However, for such an SFC-based partitio...
متن کاملDynamic load balancing for large-scale adaptive finite element computation
For the parallel computation of partial differential equations, one key is the grid partitioning. It requires that each process owns the same amount of computations, and also, the partitioning quality should be proper to reduce the communications among processes. When calculating the partial differential equations using adaptive finite element methods, the grid and the basis functions adjust in...
متن کاملHeuristic Load Balancing for CFD Codes Executed in Heterogeneous Computing Environments
A graph partitioning-based heuristic load-balancing algorithm known as the Largest Task First with Minimum Finish Time and Available Communication Costs is modified to take into account the dynamic nature and heterogeneity of current large-scale distributed computing environments, like Grids. The modified algorithm is applied to facilitate load balancing of a known CFD code used to model crysta...
متن کاملA refinement-tree based partitioning method for dynamic load balancing with adaptively refined grids
The partitioning of an adaptive grid for distribution over parallel processors is considered in the context of adaptive multilevel methods for solving partial differential equations. A partitioning method based on the refinement-tree is presented. This method applies to most types of grids in two and three dimensions. For triangular and tetrahedral grids, it is guaranteed to produce connected p...
متن کاملParallel Block-structured Adaptive Mesh Refinement for Incompressible Navier-stokes Equations
The numerical simulation of fluid flow involving complex geometries is greatly limited by the spatial grid resolution required. These flows often contain small regions with complex motions, while the remaining flow is relatively smooth. Adaptive mesh refinement (AMR) enables the spatial grid to be refined in local regions that require finer grids to resolve the flow. This work describes an appr...
متن کامل